Non-ridge-chordal complexes whose clique complex has shellable Alexander dual
نویسندگان
چکیده
A recent conjecture that appeared in three papers by Bigdeli–Faridi, Dochtermann, and Nikseresht, is every simplicial complex whose clique has shellable Alexander dual, ridge-chordal. This strengthens the long-standing Simon's k-skeleton of simplex extendably shellable, for any k. We show stronger a negative answer, exhibiting an infinite family counterexamples.
منابع مشابه
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
A forest is the clique complex of a strongly chordal graph and a quasiforest is the clique complex of a chordal graph. Kruskal–Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. Introduction Recently, in commutative algebra, the forest ([5]) and the quasi-forest ([17] and [9]) have been extensively studied. Each of these concepts is, however,...
متن کاملShellable complexes from multicomplexes
Suppose a group G acts properly on a simplicial complex Γ . Let l be the number of G-invariant vertices, and p1,p2, . . . , pm be the sizes of the G-orbits having size greater than 1. Then Γ must be a subcomplex of Λ = Δl−1 ∗ ∂Δp1−1 ∗ · · · ∗ ∂Δpm−1. A result of Novik gives necessary conditions on the face numbers of Cohen–Macaulay subcomplexes of Λ. We show that these conditions are also suffi...
متن کاملClique cutsets beyond chordal graphs
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced sub...
متن کاملPolygon Dissections Complexes Are Shellable
All dissections of a convex (mn + 2)-gons into (m + 2)-gons are facets of a simplicial complex. This complex is introduced by S. Fomin and A.V. Zelevinsky in [7]. We reprove the result of E. Tzanaki about shellability of such complex by finding a concrete shelling order. Also, we use this shelling order to find a combinatorial interpretation of h-vector and to describe the generating facets of ...
متن کاملGeneralized clique coverings of chordal graphs
Two main types 1)£ clique coveri cd phs ha'J(? d j,scussed. One is ali que c C) v p r i r, 9 Cl f \! l-''', ice S , a set ,-, f clIques which between them contain eve! 'JI? te:,c at once. The other, a clique c:-overing of edgEs, is a set f cliques which between them contain eVPIY e0ge. CllVering of edges may be deflned as a lique covering of vertices with the added rest iction hat tho=> I:'"nds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105430